Convex Relaxations of Chance Constrained AC Optimal Power Flow
نویسندگان
چکیده
High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power flow (OPF). Current approaches follow either a linearized approach or an iterative approximation of non-linearities. This paper proposes a semidefinite relaxation of a chance constrained AC-OPF which is able to provide guarantees for global optimality. Using a piecewise affine policy, we can ensure tractability, accurately model large power deviations, and determine suitable corrective control policies for active power, reactive power, and voltage. We state a tractable formulation for two types of uncertainty sets. Using a scenario-based approach and making no prior assumptions about the probability distribution of the forecast errors, we obtain a robust formulation for a rectangular uncertainty set. Alternatively, assuming a Gaussian distribution of the forecast errors, we propose an analytical reformulation of the chance constraints suitable for semidefinite programming. We demonstrate the performance of our approach on the IEEE 24 and 118 bus system using realistic day-ahead forecast data and obtain tight near-global optimality guarantees.
منابع مشابه
Convex Relaxations of Probabilistic AC Optimal Power Flow for Interconnected AC and HVDC Grids
High Voltage Direct Current (HVDC) lines and grids interconnect AC grids to increase reliability, facilitate integration of electricity markets and connect offshore wind generation. To address the growing uncertainty in the operation of such systems and fully utilize HVDC control capabilities, this work proposes a semidefinite relaxation of a chance constrained AC optimal power flow (OPF) for i...
متن کاملStrengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Lifted Nonlinear Cuts
This paper considers state-of-the-art convex relaxations for the AC power flow equations and introduces valid cuts based on convex envelopes and lifted nonlinear constraints. These valid linear inequalities strengthen existing semidefinite and quadratic programming relaxations and dominate existing cuts proposed in the literature. Combined with model intersection and bound tightening, the new l...
متن کاملChance Constraints for Improving the Security of AC Optimal Power Flow
This paper presents a scalable method for improving the solutions of AC Optimal Power Flow (AC OPF) with respect to deviations in predicted power injections from wind and other uncertain generation resources. The focus of the paper is on providing solutions that are more robust to short-term deviations, and which optimize both the initial operating point and a parametrized response policy for c...
متن کاملThe QC Relaxation: Theoretical and Computational Results on Optimal Power Flow
Convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP) and SecondOrder Cone (SOC) relaxations, have attracted significant interest in recent years. The Quadratic Convex (QC) relaxation is a departure from these relaxations in the sense that it imposes constraints to preserve stronger links between the voltage variables through convex envelopes of ...
متن کاملConvex relaxations of chance constrained optimization problems
In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1702.08372 شماره
صفحات -
تاریخ انتشار 2017